Blocking Flow Shop Scheduling Based on Hybrid Ant Colony Optimization
نویسندگان
چکیده
منابع مشابه
An Effective Hybrid Ant Colony Optimization for Permutation Flow-Shop Scheduling
This paper proposes a hybrid ant colony optimization algorithm to solve the permutation flow-shop scheduling (PFS). The hybridization of ant colony optimization (ACO) with path relinking (PR), which combines the advantages of two individual algorithms, is the key innovative aspect of the approach. Path relinking (PR) can be interpreted as an evolutionary method where the high quality solutions ...
متن کاملAnt Colony Optimization for Job Shop Scheduling Problem
This paper presents an application of the Ant colony optimization metaheuristic to the job shop scheduling problem. A pheromone alteration strategy which improves the basic ant system by utilizing the behaviour of artificial ants to perform local search is introduced. Experiments using well-known benchmark JSSP problems show that this approach improves on the performance obtained by the basic a...
متن کاملReal-World Shop Floor Scheduling by Ant Colony Optimization
Email: [email protected] Email: marco. [email protected] Email: [email protected] phone: ++49-371-531 42 52 In order to compare the reached solution quality, we used the mean ow time and the mean lateness of jobs. For the comparison of the results achieved by the means of the Ant Algorithm and other methods we used a priority rule scheduler (PRI...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملAn Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem
An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan. To solve this NP-hard problem, the IACS-HFS considers the assignment and sequencing sub-problems simultaneously in the construction procedures. The performance of the algorithm is evaluated by numerical expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2020
ISSN: 1726-4529
DOI: 10.2507/ijsimm19-2-co7